Genericity, the Arzhantseva-ol’shanskii Method and the Isomorphism Problem for One-relator Groups
نویسندگان
چکیده
We apply the method of Arzhantseva-Ol’shanskii to prove that for an exponentially generic (in the sense of Ol’shanskii) class of one-relator groups the isomorphism problem is solvable in at most exponential time. This is obtained as a corollary of the more general result that for any fixed integers m > 1, n > 0 there is an exponentially generic class of m-generator n-relator groups where every group has only one Nielsen equivalence class of m-tuples generating non-free subgroups. We also prove that all groups in this class are co-Hopfian.
منابع مشابه
On Group-theoretic Models of Randomness and Genericity
We compare the random group model of Gromov and the model of generic groups of Arzhantseva and Ol’shanskii.
متن کاملGeneric properties of Whitehead's Algorithm and isomorphism rigidity of random one-relator groups
We prove that Whitehead’s algorithm for solving the automorphism problem in a fixed free group Fk has strongly linear time generic-case complexity. This is done by showing that the “hard” part of the algorithm terminates in linear time on an exponentially generic set of input pairs. We then apply these results to one-relator groups. We obtain a Mostow-type isomorphism rigidity result for random...
متن کاملDelzant’s T-invariant, Kolmogorov Complexity and One-relator Groups
We prove that for " random " one-relator groups the Delzant T-invariant (which measures the smallest size of a finite presentation of a group) is comparable in magnitude with the length of the defining relator. The proof relies on our previous results regarding isomorphism rigidity of generic one-relator groups and on the methods of the theory of Kolmogorov-Chaitin complexity.
متن کاملThe Outer Automorphism Groups of Two-generator, One-relator Groups with Torsion
The main result of this paper is a complete classification of the outer automorphism groups of two-generator, one-relator groups with torsion. To this classification we apply recent algorithmic results of Dahmani– Guirardel, which yields an algorithm to compute the isomorphism class of the outer automorphism group of a given two-generator, one-relator group with torsion.
متن کاملGeneric properties of Whitehead's Algorithm, stabilizers in Aut(Fk) and one-relator groups
We show that the " hard " part of Whitehead's algorithm for solving the automorphism problem in a fixed free group F k terminates in linear time (in terms of the length of an input) on an exponentially generic set of input pairs and thus the algorithm has strongly linear-time generic-case complexity. We also prove that the stabilizers of generic elements of F k in Aut(F k) are cyclic groups gen...
متن کامل